Digital Straight Segment Filter for Geometric Description
نویسندگان
چکیده
In this paper, an algorithmic scheme is proposed to estimate different local characteristics of image structures using discrete geometry tools. The arithmetic properties Digital Straight Lines and their link with the Farey sequences allow introduction a new directional filter. incremental process, it provides geometric information at each point in image, such as length, orientation thickness longest Segment passing through that point. Experiments on binary grayscale images are show interest tool. Comparisons well-known morphological filter for also presented.
منابع مشابه
Revisiting Digital Straight Segment Recognition
This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognition algorithm proposed by I. Debled-Rennesson and J.-P. Reveillès in 1995 [4]. We indeed exhibit the relations describing the possible changes in the parameters of the digital straight segment under investigation. This descriptio...
متن کاملMaximal digital straight segments and convergence of discrete geometric estimators
Discrete geometric estimators approach geometric quantities on digitized shapes without any knowledge of the continuous shape. A classical yet difficult problem is to show that an estimator asymptotically converges toward the true geometric quantity as the resolution increases. We study here the convergence of local estimators based on Digital Straight Segment (DSS) recognition. It is closely l...
متن کاملGeometric Techniques for Digital Ink Geometric Techniques for Digital Ink
Handwriting is one of the most natural ways for a human to record knowledge. In recent years this type of human-computer interaction has received increasing attention due to the rapid evolution of digital ink hardware. This thesis contributes to the art of efficient recognition of handwriting and compact storage of digital ink. In the first part of the thesis, we focus on the development of alg...
متن کاملStraight{line Programs in Geometric Elimination Theory
We present a new method for solving symbolically zero–dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted data structures : arithmetic networks and straight–line programs. For sequential time complexity measured by network size we obtain the following result : it is possible to solve any affine or toric zero–dimensio...
متن کاملSegment Description of Turbulence
We propose a segment description for turbulent solutions to evolution equations in an effort to develop an effective description rather than the classical Reynolds average. The new description has connections with symbolic dynamics and shadowing technique. The challenge of future study is how to effectively implement the description numerically.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-76657-3_18